Linearizing torsion classes in the Picard group of algebraic curves over finite fields

We address the problem of computing in the group of $\ell^k$-torsion rational points of the jacobian variety of algebraic curves over finite fields, with a view toward computing modular representations.Comment: To appear in Journal of Algebr

Computing Hilbert Class Polynomials

We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm which uses the class group action on CM-curves over finite fields. Our run time analysis gives tighter bounds for the complexity of all known algorithms for computing $H_D$, and we show that all methods have comparable run times

The Beta Ansatz: A Tale of Two Complex Structures

Brane tilings, sometimes called dimer models, are a class of bipartite graphs on a torus which encode the gauge theory data of four-dimensional SCFTs dual to D3-branes probing toric Calabi-Yau threefolds. An efficient way of encoding this information exploits the theory of dessin d’enfants, expressing the structure in terms of a permutation triple, which is in turn related to a Belyi pair, namely a holomorphic map from a torus to a P1 with three marked points. The procedure of a-maximization, in the context of isoradial embeddings of the dimer, also associates a complex structure to the torus, determined by the R-charges in the SCFT, which can be compared with the Belyi complex structure. Algorithms for the explicit construction of the Belyi pairs are described in detail. In the case of orbifolds, these algorithms are related to the construction of covers of elliptic curves, which exploits the properties of Weierstraß elliptic functions. We present a counter example to a previous conjecture identifying the complex structure of the Belyi curve to the complex structure associated with R-charges

Counting points on hyperelliptic curves over finite fields

International audienceWe describe some algorithms for computing the cardinality of hyperelliptic curves and their Jacobians over finite fields. They include several methods for obtaining the result modulo small primes and prime powers, in particular an algorithm à la Schoof for genus 2 using Cantor's division polynomials. These are combined with a birthday paradox algorithm to calculate the cardinality. Our methods are practical and we give actual results computed using our current implementation. The Jacobian groups we handle are larger than those previously reported in the literature

Fast construction of irreducible polynomials over finite fields

International audienceWe present a randomized algorithm that on input a finite field $K$ with $q$ elements and a positive integer $d$ outputs a degree $d$ irreducible polynomial in $K[x]$. The running time is $d^{1+o(1)} \times (\log q)^{5+o(1)}$ elementary operations. The $o(1)$ in $d^{1+o(1)}$ is a function of $d$ that tends to zero when $d$ tends to infinity. And the $o(1)$ in $(\log q)^{5+o(1)}$ is a function of $q$ that tends to zero when $q$ tends to infinity. In particular, the complexity is quasi-linear in the degree $d$

Construction et classification de certaines solutions algébriques des systèmes de Garnier

22 pagesInternational audienceIn this paper, we classify all (complete) non elementary algebraic solutions of Garnier systems that can be constructed by Kitaev's method: they are deduced from isomonodromic deformations defined by pulling back a given fuchsian equation E by a family of ramified covers. We first introduce orbifold structures associated to a fuchsian equation. This allow to get a refined version of Riemann-Hurwitz formula and then to promtly deduce that E is hypergeometric. Then, we can bound exponents and degree of the pull-back maps and further list all possible ramification cases. This generalizes a result due to C. Doran for the Painleve VI case. We explicitely construct one of these solutions